Stabilizing polynomial approximation of explicit MPC
نویسندگان
چکیده
A given explicit piecewise affine representation of an MPC feedback law is approximated by a single polynomial, computed using linear programming. This polynomial state feedback control law guarantees closed-loop stability and constraint satisfaction. The polynomial feedback can be implemented in real time even on very simple devices with severe limitations on memory storage.
منابع مشابه
The best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملExplicit LPV-MPC with Bounded Rate of Parameter Variation
Recently it was shown how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic programming. A relaxation technique is employed to reformulate constraints which are polynomial in the scheduling parameters to parameter-independent constraints. The algorithm allows the computation of explicit control laws for LPV systems a...
متن کاملDesigning a novel structure of explicit model predictive control with application in a buck converter system
This paper proposes a novel structure of model predictive control algorithm for piecewise affine systems as a particular class of hybrid systems. Due to the time consuming and computational complexity of online optimization problem in MPC algorithm, the explicit form of MPC which is called Explicit MPC (EMPC) is applied in order to control of buck converter. Since the EMPC solves the optimizati...
متن کاملRound Optimal Concurrent MPC via Strong Simulation
In this paper, we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there are known explicit attacks that show that concurrently secure MPC with polynomial simulation is impossible to achieve; SPS security is the most widely studied model for concurrently secure MPC in the plain model. W...
متن کاملExplicit nonlinear predictive control algorithms with neural approximation
This paper describes two nonlinear Model Predictive Control (MPC) algorithms with neural approximation. The first algorithm mimics the MPC algorithm in which a linear approximation of the model is successively calculated on-line at each sampling instant and used for prediction. The second algorithm mimics the MPC strategy in which a linear approximation of the predicted output trajectory is suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 47 شماره
صفحات -
تاریخ انتشار 2011